Random density matrices: Analytical results for mean root fidelity and the mean-square Bures distance

نویسندگان

چکیده

Bures distance holds a special place among various measures due to its several distinguished features and finds applications in diverse problems quantum information theory. It is related fidelity and, other things, it serves as bona fide measure for quantifying the separability of states. In this work, we calculate exact analytical results mean root square between fixed density matrix random matrix, also two matrices. course derivation, obtain spectral product above pairs We corroborate our using Monte Carlo simulations. Moreover, compare these with reduced matrices generated coupled kicked tops find very good agreement.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the square root of quadratic matrices

Here we present a new approach to calculating the square root of a quadratic matrix. Actually, the purpose of this article is to show how the Cayley-Hamilton theorem may be used to determine an explicit formula for all the square roots of $2times 2$ matrices.

متن کامل

Harmonic mean, random polynomials and stochastic matrices

Motivated by a problem in learning theory, we are led to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the derivative of random polynomials (generated by picking their roots uniformly at random in the interval [0, 1], although our results extend to other distributions). This, in turn, requires the study of the statistical behavior of t...

متن کامل

Mean square convergence analysis for kernel least mean square algorithm

In this paper, we study the mean square convergence of the kernel least mean square (KLMS). The fundamental energy conservation relation has been established in feature space. Starting from the energy conservation relation, we carry out the mean square convergence analysis and obtain several important theoretical results, including an upper bound on step size that guarantees the mean square con...

متن کامل

A normalized root-mean-square distance for comparing protein three-dimensional structures.

The degree of similarity of two protein three-dimensional structures is usually measured with the root-mean-square distance between equivalent atom pairs. Such a similarity measure depends on the dimension of the proteins, that is, on the number of equivalent atom pairs. The present communication presents a simple procedure to make the root-mean-square distances between pairs of three-dimension...

متن کامل

Root Mean Square Minimum Distance: a Quality Metric for Localization Nanoscopy Imaging

A localization algorithm in optical localization nanoscopy plays an important role in obtaining a highquality image. By challenging 2D synthetic nanoscopy data, performances of 32 localization software packages were recently evaluated. The challenge has been advanced to focus on 3D imaging and become an open public online challenge that up to now has drawn 84 participant packages. A universal a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2021

ISSN: ['1538-4446', '1050-2947', '1094-1622']

DOI: https://doi.org/10.1103/physreva.104.022438